#include <stdio.h>
#include <stdlib.h>

#define ERROR -1
typedef int ElementType;
typedef enum { push, pop, inject, eject, end } Operation;
typedef enum { false, true } bool;
typedef int Position;
typedef struct QNode *PtrToQNode;
struct QNode {
    ElementType *Data;      /* 存储元素的数组   */
    Position Front, Rear;   /* 队列的头、尾指针 */
    int MaxSize;            /* 队列最大容量     */
};
typedef PtrToQNode Deque;

Deque CreateDeque( int MaxSize )
{   /* 注意：为区分空队列和满队列，需要多开辟一个空间 */
    Deque D = (Deque)malloc(sizeof(struct QNode));
    MaxSize++;
    D->Data = (ElementType *)malloc(MaxSize * sizeof(ElementType));
    D->Front = D->Rear = 0;
    D->MaxSize = MaxSize;
    return D;
}

bool Push( ElementType X, Deque D );
ElementType Pop( Deque D );
bool Inject( ElementType X, Deque D );
ElementType Eject( Deque D );

Operation GetOp();          /* 裁判实现，细节不表 */
void PrintDeque( Deque D ); /* 裁判实现，细节不表 */

int main()
{
    ElementType X;
    Deque D;
    int N, done = 0;

    scanf("%d", &N);
    D = CreateDeque(N);
    while (!done) {
        switch(GetOp()) {
            case push:
                scanf("%d", &X);
                if (!Push(X, D)) printf("Deque is Full!\n");
                break;
            case pop:
                X = Pop(D);
                if ( X==ERROR ) printf("Deque is Empty!\n");
                else printf("%d is out\n", X);
                break;
            case inject:
                scanf("%d", &X);
                if (!Inject(X, D)) printf("Deque is Full!\n");
                break;
            case eject:
                X = Eject(D);
                if ( X==ERROR ) printf("Deque is Empty!\n");
                else printf("%d is out\n", X);
                break;
            case end:
                PrintDeque(D);
                done = 1;
                break;
        }
    }
    return 0;
}

/* 你的代码将被嵌在这里
 * Push(X,D)：将元素X插入到双端队列D的头；
Pop(D)：删除双端队列D的头元素，并返回；
Inject(X,D)：将元素X插入到双端队列D的尾部；
Eject(D)：删除双端队列D的尾部元素，并返回。

 *
 * */


bool Push( ElementType X, Deque D ){
    if((D->Rear-D->Front+D->MaxSize) % D->MaxSize != D->MaxSize-1){
        D->Front=(D->Front-1+D->MaxSize)%D->MaxSize;
        D->Data[D->Front]=X;
        return true;
    } else{
        return false;
    }
}

ElementType Pop( Deque D ){
    if(D->Rear != D->Front){
        ElementType tmp = D->Data[D->Front];
        D->Front=(D->Front+1+D->MaxSize)%D->MaxSize;
        return tmp;
    } else{
        return ERROR;
    }


}

bool Inject( ElementType X, Deque D ){
    if((D->Rear - D->Front + D->MaxSize) % D->MaxSize != D->MaxSize - 1)
    {
        D->Data[D->Rear] = X;
        D->Rear = (D->Rear + 1 + D->MaxSize)%D->MaxSize;
        return true;
    } else{
        return false;
    }
}

ElementType Eject( Deque D ){
    if(D->Rear != D->Front){
        //删除队尾元素
        D->Rear = (D->Rear - 1 + D->MaxSize)%D->MaxSize;
        ElementType a = D->Data[D->Rear];
        return a;
    } else{
        return ERROR;
    }

}